Factoring finite abelian groups
نویسندگان
چکیده
It is shown that if in the factorization of a finite cyclic group each factor has either prime power order or order equal to the product of two primes then one factor must be periodic. This is shown to be the best possible result of this type. 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Factoring Certain Infinite Abelian Groups by Distorted Cyclic Subsets
We will prove that two results on factoring finite abelian groups into a product of subsets, related to Hajós’s and Rédei’s theorems, can be extended for certain infinite torsion abelian groups. Mathematics Subject Classification (2000): Primary 20K01; Secondary
متن کاملDecomposing finite Abelian groups
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).
متن کاملThe Possibility of Extending Factorization Results to Infinite Abelian Groups
We shall consider three results on factoring finite abelian groups by subsets. These are the Hajós’, Rédei’s and simulation theorems. As L. Fuchs has done in the case of Hajós’ theorem we shall obtain families of infinite abelian groups to which these results cannot be extended. We shall then describe classes of infinite abelian groups for which the extension does hold. MSC 2000: 20K99 (primary...
متن کاملQIP Note: On the Quantum Fourier Transform and Applications
This note introduces Fourier transforms over finite Abelian groups, and shows how this can be used to find the period of any efficiently computable periodic function. This in particular implies an efficient quantum algorithm for factoring. In the appendix we show how this generalizes to solving the hidden subgroup problem in any Abelian group. Efficient quantum algorithms for discrete log (and ...
متن کاملOn the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
متن کاملOn non-normal non-abelian subgroups of finite groups
In this paper we prove that a finite group $G$ having at most three conjugacy classes of non-normal non-abelian proper subgroups is always solvable except for $Gcong{rm{A_5}}$, which extends Theorem 3.3 in [Some sufficient conditions on the number of non-abelian subgroups of a finite group to be solvable, Acta Math. Sinica (English Series) 27 (2011) 891--896.]. Moreover, we s...
متن کامل